GRAPH: A Tool for Visualizing Communication and Optimizing Layout in Data-Parallel Programs

نویسندگان

  • Sandra G. Dykes
  • Xiaodong Zhang
  • Yi Shen
  • Clinton L. Jeffery
  • Devin W. Dean
چکیده

*GRAPH is an event-driven visualization and optimization tool for data-parallel communication, currently implemented for the C* language on the CM-5. Its goal is to help data-parallel programmers reduce their communication costs by providing information about communication bottlenecks and suggesting system directives for an optimized data layout. To accomplish this, *GRAPH provides facilities for 1. visualizing a trace of internode communication, 2. pinpointing source code statements where communication bottlenecks occur, and 3. optimizing data layout for the program's communication pattern. This paper presents the motivation for *GRAPH, its design concept and the initial implementation. We include two case studies illustrating how performance can be improved by applying *GRAPH's recommended data layout directive. Elapsed execution times were reduced by 31% for a folded convolution algorithm, and by 17% for a Gaussian elimination.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nova Visualization for Locality Optimization of Data-parallel Programs

The execution performance of scientiic application programs on parallel systems depends critically upon exploiting data locality and balancing computation loads. We have developed an event-driven visualization and optimization tool for data-parallel programs, called *Graph, which helps programmers reduce the communication costs by providing data locality information, communication bottlenecks, ...

متن کامل

A Unified Framework for Optimizing Locality, Parallelism, and Communication in Out-of-Core Computations

ÐThis paper presents a unified framework that optimizes out-of-core programs by exploiting locality and parallelism, and reducing communication overhead. For out-of-core problems where the data set sizes far exceed the size of the available in-core memory, it is particularly important to exploit the memory hierarchy by optimizing the I/O accesses. We present algorithms that consider both iterat...

متن کامل

Visual Programming for Message-Passing Systems

The attractiveness of visual programming stems in large part from the direct programmers interact with program elements as if they were real objects, since people deal better with the concrete objects than with the abstract. This paper describes a new graph based software visualization tool for parallel message-passing programming named Visper that combines the levels of abstraction at which me...

متن کامل

Optimizing a Radial Layout of Bipartite Graphs for a Tool Visualizing Security Alerts

Effective tools are crucial for visualizing large quantities of information. While developing these tools, numerous graph drawing problems emerge. We present solutions for reducing clutter in a radial visualization of a bipartite graph representing the alerts generated by an IDS protecting a computer network. Our solutions rely essentially on (i) unambiguous edge bundling to reduce the number o...

متن کامل

Demonstration of the Interactive Graph-Visualization System da Vinci

We present the graph visualization system daVinci, an interactive tool that can be used by arbitrary application programs as a user interface for graph data structures. Beside a novel automatic layout algorithm for graphs, daVinci offers many interactive facilities such as fine-tuning of a layout, abstractions and scaling operations. A bidirectional application interface is used for tool commun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995